Characterizing the Strong Maximum Principle
نویسندگان
چکیده
In this paper we characterize the degenerate elliptic equations F(Du) = 0 whose subsolutions (F(Du) ≥ 0) satisfy the strong maximum principle. We introduce an easily computed function f on (0,∞) which is determined by F, and we show that the strong maximum principle holds depending on whether ∫ 0+ dy f(y) is infinite or finite. This complements our previous work characterizing when the (ordinary) maximum principle holds. Along the way we characterize radial subsolutions.
منابع مشابه
Remarks on the Strong Maximum Principle for Nonlocal Operators
In this note, we study the existence of a strong maximum principle for the nonlocal operator
متن کاملMaximum entropy distributions of scale-invariant processes.
Organizations of many variables in nature such as soil moisture and topography exhibit patterns with no dominant scales. The maximum entropy (ME) principle is proposed to show how these variables can be statistically described using their scale-invariant properties and geometric mean. The ME principle predicts with great simplicity the probability distribution of a scale-invariant process in te...
متن کامل. A P ] 2 8 Ja n 20 05 ON HOPF ’ S LEMMA AND THE STRONG MAXIMUM PRINCIPLE
In this paper we consider Hopf’s Lemma and the Strong Maximum Principle for supersolutions to
متن کاملSpeed Gradient and MaxEnt principle for Shannon and Tsallis entropies
The notion of entropy is widely used in modern statistical physics, thermodynamics, information theory, engineering etc. In 1948, Claude Shannon introduced his information entropy for an absolutely continuous random variable x having probability density function (pdf) p. In 1988, Constantino Tsallis introduced a generalized Shannon entropy. Tsallis entropy have found applications in various sci...
متن کاملThe Strong Maximum Principle on Infinite Networks
We study the strong maximum principle for the heat equation associated with the Dirichlet form on an infinite network. We prove that the strong maximum principle is equivalent to the underlying graph being connected after deletion of the nodes with infinite degree. Using this result, we prove that the multiplicity of the eigenvalue 0 of a generalization of the Laplace matrix equals the number o...
متن کامل